A Theory of Design-by-Contract for Distributed Multiparty Interactions

نویسندگان

  • Laura Bocchi
  • Kohei Honda
  • Emilio Tuosto
  • Nobuko Yoshida
چکیده

The approach known as Design by Contract (DbC) [23] promotes reliable software development through elaboration of type signatures for sequential programs with logical formulae. This paper presents an assertion method which generalises the notion of DbC to multiparty distributed interactions, enabling the specification and verification of distributed multiparty protocols, based on the π-calculus with full recursion. Centring on the notion of global assertions and their projections onto endpoint assertions, our method allows fully general specifications for typed sessions with session channel passing, constraining the content of the exchanged messages, the choice of subconversations to follow, and invariants on recursions. The paper presents key theoretical foundations of this framework, including a validation algorithm for consistency of global assertions and a sound and relatively complete compositional proof system for verifying a large class of processes against assertions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amending Contracts for Choreographies ∗ Laura Bocchi Julien

Distributed interactions can be suitably designed in terms of choreographies. Such abstractions can be thought of as global descriptions of the coordination of several distributed parties. Global assertions define contracts for choreographies by annotating multiparty session types with logical formulae to validate the content of the exchanged messages. The introduction of such constraints is a ...

متن کامل

Amending Contracts for Choreographies

Distributed interactions can be suitably designed in terms of choreographies. Such abstractions can be thought of as global descriptions of the coordination of several distributed parties. Global assertions define contracts for choreographies by annotating multiparty session types with logical formulae to validate the content of the exchanged messages. The introduction of such constraints is a ...

متن کامل

A Typed Model for Multiparty Conversations

We present a type theory for analyzing concurrent multiparty interactions asfound in service-oriented computing, using the Conversation Calculus as under-lying model. Our theory introduces a novel and flexible type structure, able touniformly describe both the internal and the interface behavior of systems, re-ferred respectively as choreographies and contracts in web-services t...

متن کامل

A Production Cell Controlled by Dependable Multiparty Interactions

The goal of this paper is twofold. Firstly, we present a way of extracting interactions between objects and enclosing them by using multiparty interactions. In a multiparty interaction, several executing threads somehow \come together" to produce an intermediate and temporary combined state, use this state to execute some activity, and then leave this interaction and continue their normal execu...

متن کامل

Dependent Session Types for Evolving Multiparty Communication Topologies

Many application-level distributed protocols and parallel algorithms are dynamic in nature: the number of participants, messages or repetitions is only known at run-time, and the communication topology may be altered during the execution. This paper proposes a dependent type theory for multiparty sessions which can statically guarantee type-safe, deadlock-free multiparty interactions among proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010